- spanning trees
- 1) Компьютерная техника: основные деревья2) Вычислительная техника: охват деревьев3) Сетевые технологии: "охват деревьев"
Универсальный англо-русский словарь. Академик.ру. 2011.
spanning trees
Смотреть что такое "spanning trees" в других словарях:
Spanning tree — can refer to:* Spanning tree (mathematics), a tree which contains every vertex of a more general graph * Spanning tree protocol, a protocol for finding spanning trees in bridged networks … Wikipedia
Spanning tree (mathematics) — In the mathematical field of graph theory, a spanning tree T of a connected, undirected graph G is a tree composed of all the vertices and some (or perhaps all) of the edges of G . Informally, a spanning tree of G is a selection of edges of G… … Wikipedia
Minimum spanning tree — The minimum spanning tree of a planar graph. Each edge is labeled with its weight, which here is roughly proportional to its length. Given a connected, undirected graph, a spanning tree of that graph is a subgraph that is a tree and connects all… … Wikipedia
Euclidean minimum spanning tree — The Euclidean minimum spanning tree or EMST is a minimum spanning tree of a set of points in the plane (or more generally in Bbb{R}^n), where the weight of the edge between each pair of points is the distance between those two points. In simpler… … Wikipedia
Distributed minimum spanning tree — The distributed minimum spanning tree problem involves the construction of a minimum spanning tree by a distributed algorithm, in a network where nodes communicate by message passing. It is radically different from the classical sequential… … Wikipedia
Random minimal spanning tree — In mathematics, random minimal spanning tree, or random MST, is a model (actually two related models) for a random tree (see also minimal spanning tree). It might be compared against the uniform spanning tree, a different model for a random tree… … Wikipedia
Minimum degree spanning tree — In graph theory, for a connected graph G, a spanning tree T is a subgraph of G with the least number of edges that still spans G. A number of properties can be proved about T. T is acyclic, has ( | V | − 1) edges where V is the number of vertices … Wikipedia
Parliament of Trees — comicbookspecies imagesize= caption= Cover to Swamp Thing #47. publisher=DC Comics debut= Swamp Thing Vol. 2 #47 (April 1986) creators=Alan Moore and Stan Woch deities=Fictional homeworld=Brazil, South America notable members=Bifa Bog Venus Canan … Wikipedia
Tree (graph theory) — Trees A labeled tree with 6 vertices and 5 edges Vertices v Edges v 1 Chromatic number … Wikipedia
Kirchhoff's theorem — In the mathematical field of graph theory Kirchhoff s theorem or Kirchhoff s matrix tree theorem named after Gustav Kirchhoff is a theorem about the number of spanning trees in a graph. It is a generalization of Cayley s formula which provides… … Wikipedia
Loop-erased random walk — In mathematics, loop erased random walk is a model for a random simple path with important applications in combinatorics and, in physics, quantum field theory. It is intimately connected to the uniform spanning tree, a model for a random tree.… … Wikipedia
